Combining Tree and Feature Classification in Fractal Encoding of Images
نویسنده
چکیده
One of the main problems with fractal compression of images is the long encoding time, due to the repeated search of the domain block pool. Faster search can be achieved through block classification. This is done by grouping the domain blocks independently and online into predefined classes. Only the class of a range block is then searched for a matching domain. In [I], we presented another method for speeding up the search. It is based on an incremental evaluation of the distance between two blocks. We structure the domain pool into a tree. For a given range, we home onto a list of matching domains through a pruning algorithm based on the evaluation procedure. In this work we combine the tree method with the block classification to get an even faster search. In block classification the classes are stored without any additional structure, usually as lists, and searched linearly until a best match is found. We should expect an enhancement if we arrange the classes into trees, and use the tree algorithm for the search. Another way to view this is to regard the domain pool grown into lots of small trees rather than one big one. A significant speed-up is achievable provided, firstly that only reasonable size classes are grown into trees, and secondly that the feature extraction methods for the classification and for the tree construction should be independent. We used the Jacobs, Fisher and Boss method for classification, which depends on block quadrant averages as explained in Fisher’s book [2]. The book includes also an implementation. We modified the code to include the tree search method. The evaluation algorithm is unaffected by unitary transforms, as it is based on Euclidean distance. To use an independent method, we compute the direct cosine transform of the blocks in each class and use the low frequency coefficients to construct the tree. The experiments show a speed-up of around 75% over the the purely classification based method, with a drop in PSNR of about 1dB. The visual quality of the decoded images are very similar.
منابع مشابه
Improving security of double random phase encoding with chaos theory using fractal images
This study presents a new method based on the combination of cryptography and information hiding methods. Firstly, the image is encoded by the Double Random Phase Encoding (DRPE) technique. The real and imaginary parts of the encoded image are subsequently embedded into an enlarged normalized host image. DRPE demands two random phase mask keys to decode the decrypted image at the destination. T...
متن کاملFractal Encoding by Classified Domain Trees
Fractal coding of digital images o ers many promising qualities. The encoding process, however, su ers from the long search time of the domain block pool. A standard technique for speeding up the encoding is the feature classi cation of blocks. In this paper we show that the classes can be arranged in a tree, and searched by a pruning algorithm developed and explained in a previous paper by the...
متن کاملComparison of Machine Learning Algorithms for Broad Leaf Species Classification Using UAV-RGB Images
Abstract: Knowing the tree species combination of forests provides valuable information for studying the forest’s economic value, fire risk assessment, biodiversity monitoring, and wildlife habitat improvement. Fieldwork is often time-consuming and labor-required, free satellite data are available in coarse resolution and the use of manned aircraft is relatively costly. Recently, unmanned aeria...
متن کاملAutomatic Face Recognition via Local Directional Patterns
Automatic facial recognition has many potential applications in different areas of humancomputer interaction. However, they are not yet fully realized due to the lack of an effectivefacial feature descriptor. In this paper, we present a new appearance based feature descriptor,the local directional pattern (LDP), to represent facial geometry and analyze its performance inrecognition. An LDP feat...
متن کاملReceptive Field Encoding Model for Dynamic Natural Vision
Introduction: Encoding models are used to predict human brain activity in response to sensory stimuli. The purpose of these models is to explain how sensory information represent in the brain. Convolutional neural networks trained by images are capable of encoding magnetic resonance imaging data of humans viewing natural images. Considering the hemodynamic response function, these networks are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996